Improved generalized successive cancellation list flip decoder of polar codes with fast decoding of special nodes

In this paper, an improvement for SC list flip (SCL-Flip) decoding is presented polar codes. A novel bit-selection metric critical set (set of information symbols codes being flipped during additional attempts) based on path successive cancellation (SCL) suggested. With the proposed metric, improved SCL scheme special nodes (SN) decoders was developed. This decoder will be denoted by GSCLF. The main idea joint using two approaches: first one a fast in binary tree representation code (e.g., some that allow efficient with low complexity) and second applying attempts (flips) case when initial erroneous. simultaneous use these approaches results both significant reduction spatial complexity number computations required whereas keeping excellent performance. Simulation paper us to conclude computational GSCLF from 66% 80% smaller than SCL-32 decoder.